Size constrained clustering problems in fixed dimension
نویسنده
چکیده
Clustering or cluster analysis [1] is a classical method in unsupervised learning and one of the most used techniques in statistical data analysis. Clustering has a wide range of applications in many areas like pattern recognition, medical diagnostics, data mining, biology, market research and image analysis among others. A cluster is a set of data points that in some sense are similar to each other, and clustering is a process of partitioning a data set into disjoint clusters. In distance clustering, the similarity among data points is obtained by means of a distance function.
منابع مشابه
Repeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملEquivalent a posteriori error estimates for spectral element solutions of constrained optimal control problem in one dimension
In this paper, we study spectral element approximation for a constrained optimal control problem in one dimension. The equivalent a posteriori error estimators are derived for the control, the state and the adjoint state approximation. Such estimators can be used to construct adaptive spectral elements for the control problems.
متن کاملClustering for high-dimension, low-sample size data using distance vectors
In high-dimension, low-sample size (HDLSS) data, it is not always true that closeness of two objects reflects a hidden cluster structure. We point out the important fact that it is not the closeness, but the “values” of distance that contain information of the cluster structure in highdimensional space. Based on this fact, we propose an efficient and simple clustering approach, called distance ...
متن کاملOn the Sensitivity of Shape Fitting Problems
In this article, we study shape fitting problems, -coresets, and total sensitivity. We focus on the (j, k)-projective clustering problems, including k-median/k-means, k-line clustering, j-subspace approximation, and the integer (j, k)-projective clustering problem. We derive upper bounds of total sensitivities for these problems, and obtain -coresets using these upper bounds. Using a dimension-...
متن کاملCombination of Genetic Algorithm With Lagrange Multipliers For Lot-Size Determination in Capacity Constrained Multi-Period, Multi-Product and Multi-Stage Problems
Abstract : In this paper a meta-heuristic approach has been presented to solve lot-size determination problems in a complex multi-stage production planning problems with production capacity constraint. This type of problems has multiple products with sequential production processes which are manufactured in different periods to meet customer’s demand. By determining the decision variables, mac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012